Factoring and Discrete Logarithm Using IBC

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Factoring and Discrete Logarithm using IBC

In 1984, Shamir proposed the concept of the ID-based cryptosystem (IBC). Instead of generating and publishing a public key for each user, the ID-based scheme permits each user to choose his name or network address as his public key. This is advantageous to public-key cryptosystems because the public-key verification is so easy and direct. In such a way, a large public key file is not required. ...

متن کامل

A Factoring and Discrete Logarithm based Cryptosystem

This paper introduces a new public key cryptosystem based on two hard problems : the cube root extraction modulo a composite moduli (which is equivalent to the factorisation of the moduli) and the discrete logarithm problem. These two hard problems are combined during the key generation, encryption and decryption phases. By combining the IFP and the DLP we introduce a secure and efficient publi...

متن کامل

An Efficient Signature Scheme based on Factoring and Discrete Logarithm

This paper proposes a new signature scheme based on two hard problems : the cube root extraction modulo a composite moduli (which is equivalent to the factorisation of the moduli, IFP) and the discrete logarithm problem(DLP). By combining these two cryptographic assumptions, we introduce an efficient and strongly secure signature scheme. We show that if an adversary can break the new scheme wit...

متن کامل

Factoring and Discrete Logarithms using Pseudorandom Walks

This is a chapter from version 1.1 of the book “Mathematics of Public Key Cryptography” by Steven Galbraith, available from http://www.isg.rhul.ac.uk/̃ sdg/crypto-book/ The copyright for this chapter is held by Steven Galbraith. This book is now completed and an edited version of it will be published by Cambridge University Press in early 2012. Some of the Theorem/Lemma/Exercise numbers may be d...

متن کامل

A New Digital Signature Scheme Based on Integer Factoring and Discrete Logarithm Problem

A new idea for digital signature scheme is suggested. The suggested scheme employs a composite modulus that is a product of two distinct prime numbers. There is a similarity with the most widely used digital signature schemes such as RSA regarding the algebraic background. The new scheme uses operations in prime integer order, a characteristic that is similar to Digital Signature Standard ( DSS...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Hybrid Information Technology

سال: 2015

ISSN: 1738-9968

DOI: 10.14257/ijhit.2015.8.3.12